Networked conflicting timed event graphs representation in (Max,+) algebra

Networked conflicting timed event graphs representation in (Max, +) algebra

Timed Event Graphs (TEGs) are a specific class of Petri nets that have been thoroughly studied given their useful linear state representation in (Max,+) algebra. Unfortunately, TEGs are generally not suitable for modeling systems displaying resources sharing (or conflicts). In this paper, we show that if a system with conflicts is modeled using a NCTEG (Networked Conflicting Timed Event Graphs)...

Timed Event Graphs with variable resources: asymptotic behavior, representation in (min,+) algebra

Our aim is to demonstrate that the approach developed for Timed Event Graphs over (min;+) algebra may be extended to a broader subclass of Petri Nets. The graphs considered can be seen as Timed Event Graphs on which some source and/or sink transitions are added to some places. Elements of performance evaluation and the linear representation of these systems over the (min,+) algebra (state model...

A (max,+) Algebra for Non-stationary Periodic Timed Discrete Event Systems

We deene and implement a (max,+) algebra of signals for the timing analysis of discrete event systems expressed as timed event graphs. A system is deened by the innnite, periodic time sequences of its events. Each sequence has a nite representations called a signal. The resulting tool can also compute supre-mal controllers for timed discrete event systems.

Reachability analysis for timed automata using max-plus algebra

We show that max-plus polyhedra are usable as a data structure in reachability analysis of timed automata. Drawing inspiration from the extensive work that has been done on difference bound matrices, as well as previous work on max-plus polyhedra in other areas, we develop the algorithms needed to perform forward and backward reachability analysis using maxplus polyhedra. To show that the appro...

Reachability Analysis for Timed Models using Max-Plus Algebra